(0) Obligation:

Clauses:

goal(X) :- ','(s2l(X, Xs), conf(Xs)).
conf(X) :- ','(del2(X, Z), ','(del(U, Y, Z), conf(Y))).
del2(X, Y) :- ','(del(U, X, Z), del(V, Z, Y)).
del(X1, [], X2) :- ','(!, failure(a)).
del(H, X, T) :- ','(head(X, H), tail(X, T)).
del(X, Y, .(H, T2)) :- ','(head(Y, H), ','(tail(Y, T1), del(X, T1, T2))).
s2l(0, L) :- ','(!, eq(L, [])).
s2l(X, .(X3, Xs)) :- ','(p(X, P), s2l(P, Xs)).
head([], X4).
head(.(H, X5), H).
tail([], []).
tail(.(X6, Xs), Xs).
p(0, 0).
p(s(X), X).
failure(b).
eq(X, X).

Query: goal(g)

(1) PrologToPrologProblemTransformerProof (SOUND transformation)

Built Prolog problem from termination graph ICLP10.

(2) Obligation:

Clauses:

delA(X151, [], []).
delA(T29, .(T29, T30), T30).
delA(X190, .(T49, T51), .(T49, X192)) :- delA(X190, T51, X192).
confE(T65) :- del2F(T65, X280).
s2lG(0, []).
s2lG(s(T89), .(X386, X387)) :- s2lG(T89, X387).
del2F(T73, X313) :- delA(X310, T73, X311).
del2F(T73, X313) :- ','(delA(T74, T73, T75), delA(X312, T75, X313)).
goalI(s(T82)) :- s2lG(T82, X347).
goalI(s(T82)) :- ','(s2lG(T82, T83), confE(.(X346, T83))).

Query: goalI(g)

(3) PrologToPiTRSProof (SOUND transformation)

We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes:
goalI_in: (b)
s2lG_in: (b,f)
confE_in: (b)
del2F_in: (b,f)
delA_in: (f,b,f)
Transforming Prolog into the following Term Rewriting System:
Pi-finite rewrite system:
The TRS R consists of the following rules:

goalI_in_g(s(T82)) → U7_g(T82, s2lG_in_ga(T82, X347))
s2lG_in_ga(0, []) → s2lG_out_ga(0, [])
s2lG_in_ga(s(T89), .(X386, X387)) → U3_ga(T89, X386, X387, s2lG_in_ga(T89, X387))
U3_ga(T89, X386, X387, s2lG_out_ga(T89, X387)) → s2lG_out_ga(s(T89), .(X386, X387))
U7_g(T82, s2lG_out_ga(T82, X347)) → goalI_out_g(s(T82))
goalI_in_g(s(T82)) → U8_g(T82, s2lG_in_ga(T82, T83))
U8_g(T82, s2lG_out_ga(T82, T83)) → U9_g(T82, confE_in_g(.(X346, T83)))
confE_in_g(T65) → U2_g(T65, del2F_in_ga(T65, X280))
del2F_in_ga(T73, X313) → U4_ga(T73, X313, delA_in_aga(X310, T73, X311))
delA_in_aga(X151, [], []) → delA_out_aga(X151, [], [])
delA_in_aga(T29, .(T29, T30), T30) → delA_out_aga(T29, .(T29, T30), T30)
delA_in_aga(X190, .(T49, T51), .(T49, X192)) → U1_aga(X190, T49, T51, X192, delA_in_aga(X190, T51, X192))
U1_aga(X190, T49, T51, X192, delA_out_aga(X190, T51, X192)) → delA_out_aga(X190, .(T49, T51), .(T49, X192))
U4_ga(T73, X313, delA_out_aga(X310, T73, X311)) → del2F_out_ga(T73, X313)
del2F_in_ga(T73, X313) → U5_ga(T73, X313, delA_in_aga(T74, T73, T75))
U5_ga(T73, X313, delA_out_aga(T74, T73, T75)) → U6_ga(T73, X313, delA_in_aga(X312, T75, X313))
U6_ga(T73, X313, delA_out_aga(X312, T75, X313)) → del2F_out_ga(T73, X313)
U2_g(T65, del2F_out_ga(T65, X280)) → confE_out_g(T65)
U9_g(T82, confE_out_g(.(X346, T83))) → goalI_out_g(s(T82))

The argument filtering Pi contains the following mapping:
goalI_in_g(x1)  =  goalI_in_g(x1)
s(x1)  =  s(x1)
U7_g(x1, x2)  =  U7_g(x2)
s2lG_in_ga(x1, x2)  =  s2lG_in_ga(x1)
0  =  0
s2lG_out_ga(x1, x2)  =  s2lG_out_ga(x2)
U3_ga(x1, x2, x3, x4)  =  U3_ga(x4)
.(x1, x2)  =  .(x2)
goalI_out_g(x1)  =  goalI_out_g
U8_g(x1, x2)  =  U8_g(x2)
U9_g(x1, x2)  =  U9_g(x2)
confE_in_g(x1)  =  confE_in_g(x1)
U2_g(x1, x2)  =  U2_g(x2)
del2F_in_ga(x1, x2)  =  del2F_in_ga(x1)
U4_ga(x1, x2, x3)  =  U4_ga(x3)
delA_in_aga(x1, x2, x3)  =  delA_in_aga(x2)
[]  =  []
delA_out_aga(x1, x2, x3)  =  delA_out_aga(x3)
U1_aga(x1, x2, x3, x4, x5)  =  U1_aga(x5)
del2F_out_ga(x1, x2)  =  del2F_out_ga
U5_ga(x1, x2, x3)  =  U5_ga(x3)
U6_ga(x1, x2, x3)  =  U6_ga(x3)
confE_out_g(x1)  =  confE_out_g

Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog

(4) Obligation:

Pi-finite rewrite system:
The TRS R consists of the following rules:

goalI_in_g(s(T82)) → U7_g(T82, s2lG_in_ga(T82, X347))
s2lG_in_ga(0, []) → s2lG_out_ga(0, [])
s2lG_in_ga(s(T89), .(X386, X387)) → U3_ga(T89, X386, X387, s2lG_in_ga(T89, X387))
U3_ga(T89, X386, X387, s2lG_out_ga(T89, X387)) → s2lG_out_ga(s(T89), .(X386, X387))
U7_g(T82, s2lG_out_ga(T82, X347)) → goalI_out_g(s(T82))
goalI_in_g(s(T82)) → U8_g(T82, s2lG_in_ga(T82, T83))
U8_g(T82, s2lG_out_ga(T82, T83)) → U9_g(T82, confE_in_g(.(X346, T83)))
confE_in_g(T65) → U2_g(T65, del2F_in_ga(T65, X280))
del2F_in_ga(T73, X313) → U4_ga(T73, X313, delA_in_aga(X310, T73, X311))
delA_in_aga(X151, [], []) → delA_out_aga(X151, [], [])
delA_in_aga(T29, .(T29, T30), T30) → delA_out_aga(T29, .(T29, T30), T30)
delA_in_aga(X190, .(T49, T51), .(T49, X192)) → U1_aga(X190, T49, T51, X192, delA_in_aga(X190, T51, X192))
U1_aga(X190, T49, T51, X192, delA_out_aga(X190, T51, X192)) → delA_out_aga(X190, .(T49, T51), .(T49, X192))
U4_ga(T73, X313, delA_out_aga(X310, T73, X311)) → del2F_out_ga(T73, X313)
del2F_in_ga(T73, X313) → U5_ga(T73, X313, delA_in_aga(T74, T73, T75))
U5_ga(T73, X313, delA_out_aga(T74, T73, T75)) → U6_ga(T73, X313, delA_in_aga(X312, T75, X313))
U6_ga(T73, X313, delA_out_aga(X312, T75, X313)) → del2F_out_ga(T73, X313)
U2_g(T65, del2F_out_ga(T65, X280)) → confE_out_g(T65)
U9_g(T82, confE_out_g(.(X346, T83))) → goalI_out_g(s(T82))

The argument filtering Pi contains the following mapping:
goalI_in_g(x1)  =  goalI_in_g(x1)
s(x1)  =  s(x1)
U7_g(x1, x2)  =  U7_g(x2)
s2lG_in_ga(x1, x2)  =  s2lG_in_ga(x1)
0  =  0
s2lG_out_ga(x1, x2)  =  s2lG_out_ga(x2)
U3_ga(x1, x2, x3, x4)  =  U3_ga(x4)
.(x1, x2)  =  .(x2)
goalI_out_g(x1)  =  goalI_out_g
U8_g(x1, x2)  =  U8_g(x2)
U9_g(x1, x2)  =  U9_g(x2)
confE_in_g(x1)  =  confE_in_g(x1)
U2_g(x1, x2)  =  U2_g(x2)
del2F_in_ga(x1, x2)  =  del2F_in_ga(x1)
U4_ga(x1, x2, x3)  =  U4_ga(x3)
delA_in_aga(x1, x2, x3)  =  delA_in_aga(x2)
[]  =  []
delA_out_aga(x1, x2, x3)  =  delA_out_aga(x3)
U1_aga(x1, x2, x3, x4, x5)  =  U1_aga(x5)
del2F_out_ga(x1, x2)  =  del2F_out_ga
U5_ga(x1, x2, x3)  =  U5_ga(x3)
U6_ga(x1, x2, x3)  =  U6_ga(x3)
confE_out_g(x1)  =  confE_out_g

(5) DependencyPairsProof (EQUIVALENT transformation)

Using Dependency Pairs [AG00,LOPSTR] we result in the following initial DP problem:
Pi DP problem:
The TRS P consists of the following rules:

GOALI_IN_G(s(T82)) → U7_G(T82, s2lG_in_ga(T82, X347))
GOALI_IN_G(s(T82)) → S2LG_IN_GA(T82, X347)
S2LG_IN_GA(s(T89), .(X386, X387)) → U3_GA(T89, X386, X387, s2lG_in_ga(T89, X387))
S2LG_IN_GA(s(T89), .(X386, X387)) → S2LG_IN_GA(T89, X387)
GOALI_IN_G(s(T82)) → U8_G(T82, s2lG_in_ga(T82, T83))
U8_G(T82, s2lG_out_ga(T82, T83)) → U9_G(T82, confE_in_g(.(X346, T83)))
U8_G(T82, s2lG_out_ga(T82, T83)) → CONFE_IN_G(.(X346, T83))
CONFE_IN_G(T65) → U2_G(T65, del2F_in_ga(T65, X280))
CONFE_IN_G(T65) → DEL2F_IN_GA(T65, X280)
DEL2F_IN_GA(T73, X313) → U4_GA(T73, X313, delA_in_aga(X310, T73, X311))
DEL2F_IN_GA(T73, X313) → DELA_IN_AGA(X310, T73, X311)
DELA_IN_AGA(X190, .(T49, T51), .(T49, X192)) → U1_AGA(X190, T49, T51, X192, delA_in_aga(X190, T51, X192))
DELA_IN_AGA(X190, .(T49, T51), .(T49, X192)) → DELA_IN_AGA(X190, T51, X192)
DEL2F_IN_GA(T73, X313) → U5_GA(T73, X313, delA_in_aga(T74, T73, T75))
U5_GA(T73, X313, delA_out_aga(T74, T73, T75)) → U6_GA(T73, X313, delA_in_aga(X312, T75, X313))
U5_GA(T73, X313, delA_out_aga(T74, T73, T75)) → DELA_IN_AGA(X312, T75, X313)

The TRS R consists of the following rules:

goalI_in_g(s(T82)) → U7_g(T82, s2lG_in_ga(T82, X347))
s2lG_in_ga(0, []) → s2lG_out_ga(0, [])
s2lG_in_ga(s(T89), .(X386, X387)) → U3_ga(T89, X386, X387, s2lG_in_ga(T89, X387))
U3_ga(T89, X386, X387, s2lG_out_ga(T89, X387)) → s2lG_out_ga(s(T89), .(X386, X387))
U7_g(T82, s2lG_out_ga(T82, X347)) → goalI_out_g(s(T82))
goalI_in_g(s(T82)) → U8_g(T82, s2lG_in_ga(T82, T83))
U8_g(T82, s2lG_out_ga(T82, T83)) → U9_g(T82, confE_in_g(.(X346, T83)))
confE_in_g(T65) → U2_g(T65, del2F_in_ga(T65, X280))
del2F_in_ga(T73, X313) → U4_ga(T73, X313, delA_in_aga(X310, T73, X311))
delA_in_aga(X151, [], []) → delA_out_aga(X151, [], [])
delA_in_aga(T29, .(T29, T30), T30) → delA_out_aga(T29, .(T29, T30), T30)
delA_in_aga(X190, .(T49, T51), .(T49, X192)) → U1_aga(X190, T49, T51, X192, delA_in_aga(X190, T51, X192))
U1_aga(X190, T49, T51, X192, delA_out_aga(X190, T51, X192)) → delA_out_aga(X190, .(T49, T51), .(T49, X192))
U4_ga(T73, X313, delA_out_aga(X310, T73, X311)) → del2F_out_ga(T73, X313)
del2F_in_ga(T73, X313) → U5_ga(T73, X313, delA_in_aga(T74, T73, T75))
U5_ga(T73, X313, delA_out_aga(T74, T73, T75)) → U6_ga(T73, X313, delA_in_aga(X312, T75, X313))
U6_ga(T73, X313, delA_out_aga(X312, T75, X313)) → del2F_out_ga(T73, X313)
U2_g(T65, del2F_out_ga(T65, X280)) → confE_out_g(T65)
U9_g(T82, confE_out_g(.(X346, T83))) → goalI_out_g(s(T82))

The argument filtering Pi contains the following mapping:
goalI_in_g(x1)  =  goalI_in_g(x1)
s(x1)  =  s(x1)
U7_g(x1, x2)  =  U7_g(x2)
s2lG_in_ga(x1, x2)  =  s2lG_in_ga(x1)
0  =  0
s2lG_out_ga(x1, x2)  =  s2lG_out_ga(x2)
U3_ga(x1, x2, x3, x4)  =  U3_ga(x4)
.(x1, x2)  =  .(x2)
goalI_out_g(x1)  =  goalI_out_g
U8_g(x1, x2)  =  U8_g(x2)
U9_g(x1, x2)  =  U9_g(x2)
confE_in_g(x1)  =  confE_in_g(x1)
U2_g(x1, x2)  =  U2_g(x2)
del2F_in_ga(x1, x2)  =  del2F_in_ga(x1)
U4_ga(x1, x2, x3)  =  U4_ga(x3)
delA_in_aga(x1, x2, x3)  =  delA_in_aga(x2)
[]  =  []
delA_out_aga(x1, x2, x3)  =  delA_out_aga(x3)
U1_aga(x1, x2, x3, x4, x5)  =  U1_aga(x5)
del2F_out_ga(x1, x2)  =  del2F_out_ga
U5_ga(x1, x2, x3)  =  U5_ga(x3)
U6_ga(x1, x2, x3)  =  U6_ga(x3)
confE_out_g(x1)  =  confE_out_g
GOALI_IN_G(x1)  =  GOALI_IN_G(x1)
U7_G(x1, x2)  =  U7_G(x2)
S2LG_IN_GA(x1, x2)  =  S2LG_IN_GA(x1)
U3_GA(x1, x2, x3, x4)  =  U3_GA(x4)
U8_G(x1, x2)  =  U8_G(x2)
U9_G(x1, x2)  =  U9_G(x2)
CONFE_IN_G(x1)  =  CONFE_IN_G(x1)
U2_G(x1, x2)  =  U2_G(x2)
DEL2F_IN_GA(x1, x2)  =  DEL2F_IN_GA(x1)
U4_GA(x1, x2, x3)  =  U4_GA(x3)
DELA_IN_AGA(x1, x2, x3)  =  DELA_IN_AGA(x2)
U1_AGA(x1, x2, x3, x4, x5)  =  U1_AGA(x5)
U5_GA(x1, x2, x3)  =  U5_GA(x3)
U6_GA(x1, x2, x3)  =  U6_GA(x3)

We have to consider all (P,R,Pi)-chains

(6) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

GOALI_IN_G(s(T82)) → U7_G(T82, s2lG_in_ga(T82, X347))
GOALI_IN_G(s(T82)) → S2LG_IN_GA(T82, X347)
S2LG_IN_GA(s(T89), .(X386, X387)) → U3_GA(T89, X386, X387, s2lG_in_ga(T89, X387))
S2LG_IN_GA(s(T89), .(X386, X387)) → S2LG_IN_GA(T89, X387)
GOALI_IN_G(s(T82)) → U8_G(T82, s2lG_in_ga(T82, T83))
U8_G(T82, s2lG_out_ga(T82, T83)) → U9_G(T82, confE_in_g(.(X346, T83)))
U8_G(T82, s2lG_out_ga(T82, T83)) → CONFE_IN_G(.(X346, T83))
CONFE_IN_G(T65) → U2_G(T65, del2F_in_ga(T65, X280))
CONFE_IN_G(T65) → DEL2F_IN_GA(T65, X280)
DEL2F_IN_GA(T73, X313) → U4_GA(T73, X313, delA_in_aga(X310, T73, X311))
DEL2F_IN_GA(T73, X313) → DELA_IN_AGA(X310, T73, X311)
DELA_IN_AGA(X190, .(T49, T51), .(T49, X192)) → U1_AGA(X190, T49, T51, X192, delA_in_aga(X190, T51, X192))
DELA_IN_AGA(X190, .(T49, T51), .(T49, X192)) → DELA_IN_AGA(X190, T51, X192)
DEL2F_IN_GA(T73, X313) → U5_GA(T73, X313, delA_in_aga(T74, T73, T75))
U5_GA(T73, X313, delA_out_aga(T74, T73, T75)) → U6_GA(T73, X313, delA_in_aga(X312, T75, X313))
U5_GA(T73, X313, delA_out_aga(T74, T73, T75)) → DELA_IN_AGA(X312, T75, X313)

The TRS R consists of the following rules:

goalI_in_g(s(T82)) → U7_g(T82, s2lG_in_ga(T82, X347))
s2lG_in_ga(0, []) → s2lG_out_ga(0, [])
s2lG_in_ga(s(T89), .(X386, X387)) → U3_ga(T89, X386, X387, s2lG_in_ga(T89, X387))
U3_ga(T89, X386, X387, s2lG_out_ga(T89, X387)) → s2lG_out_ga(s(T89), .(X386, X387))
U7_g(T82, s2lG_out_ga(T82, X347)) → goalI_out_g(s(T82))
goalI_in_g(s(T82)) → U8_g(T82, s2lG_in_ga(T82, T83))
U8_g(T82, s2lG_out_ga(T82, T83)) → U9_g(T82, confE_in_g(.(X346, T83)))
confE_in_g(T65) → U2_g(T65, del2F_in_ga(T65, X280))
del2F_in_ga(T73, X313) → U4_ga(T73, X313, delA_in_aga(X310, T73, X311))
delA_in_aga(X151, [], []) → delA_out_aga(X151, [], [])
delA_in_aga(T29, .(T29, T30), T30) → delA_out_aga(T29, .(T29, T30), T30)
delA_in_aga(X190, .(T49, T51), .(T49, X192)) → U1_aga(X190, T49, T51, X192, delA_in_aga(X190, T51, X192))
U1_aga(X190, T49, T51, X192, delA_out_aga(X190, T51, X192)) → delA_out_aga(X190, .(T49, T51), .(T49, X192))
U4_ga(T73, X313, delA_out_aga(X310, T73, X311)) → del2F_out_ga(T73, X313)
del2F_in_ga(T73, X313) → U5_ga(T73, X313, delA_in_aga(T74, T73, T75))
U5_ga(T73, X313, delA_out_aga(T74, T73, T75)) → U6_ga(T73, X313, delA_in_aga(X312, T75, X313))
U6_ga(T73, X313, delA_out_aga(X312, T75, X313)) → del2F_out_ga(T73, X313)
U2_g(T65, del2F_out_ga(T65, X280)) → confE_out_g(T65)
U9_g(T82, confE_out_g(.(X346, T83))) → goalI_out_g(s(T82))

The argument filtering Pi contains the following mapping:
goalI_in_g(x1)  =  goalI_in_g(x1)
s(x1)  =  s(x1)
U7_g(x1, x2)  =  U7_g(x2)
s2lG_in_ga(x1, x2)  =  s2lG_in_ga(x1)
0  =  0
s2lG_out_ga(x1, x2)  =  s2lG_out_ga(x2)
U3_ga(x1, x2, x3, x4)  =  U3_ga(x4)
.(x1, x2)  =  .(x2)
goalI_out_g(x1)  =  goalI_out_g
U8_g(x1, x2)  =  U8_g(x2)
U9_g(x1, x2)  =  U9_g(x2)
confE_in_g(x1)  =  confE_in_g(x1)
U2_g(x1, x2)  =  U2_g(x2)
del2F_in_ga(x1, x2)  =  del2F_in_ga(x1)
U4_ga(x1, x2, x3)  =  U4_ga(x3)
delA_in_aga(x1, x2, x3)  =  delA_in_aga(x2)
[]  =  []
delA_out_aga(x1, x2, x3)  =  delA_out_aga(x3)
U1_aga(x1, x2, x3, x4, x5)  =  U1_aga(x5)
del2F_out_ga(x1, x2)  =  del2F_out_ga
U5_ga(x1, x2, x3)  =  U5_ga(x3)
U6_ga(x1, x2, x3)  =  U6_ga(x3)
confE_out_g(x1)  =  confE_out_g
GOALI_IN_G(x1)  =  GOALI_IN_G(x1)
U7_G(x1, x2)  =  U7_G(x2)
S2LG_IN_GA(x1, x2)  =  S2LG_IN_GA(x1)
U3_GA(x1, x2, x3, x4)  =  U3_GA(x4)
U8_G(x1, x2)  =  U8_G(x2)
U9_G(x1, x2)  =  U9_G(x2)
CONFE_IN_G(x1)  =  CONFE_IN_G(x1)
U2_G(x1, x2)  =  U2_G(x2)
DEL2F_IN_GA(x1, x2)  =  DEL2F_IN_GA(x1)
U4_GA(x1, x2, x3)  =  U4_GA(x3)
DELA_IN_AGA(x1, x2, x3)  =  DELA_IN_AGA(x2)
U1_AGA(x1, x2, x3, x4, x5)  =  U1_AGA(x5)
U5_GA(x1, x2, x3)  =  U5_GA(x3)
U6_GA(x1, x2, x3)  =  U6_GA(x3)

We have to consider all (P,R,Pi)-chains

(7) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LOPSTR] contains 2 SCCs with 14 less nodes.

(8) Complex Obligation (AND)

(9) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

DELA_IN_AGA(X190, .(T49, T51), .(T49, X192)) → DELA_IN_AGA(X190, T51, X192)

The TRS R consists of the following rules:

goalI_in_g(s(T82)) → U7_g(T82, s2lG_in_ga(T82, X347))
s2lG_in_ga(0, []) → s2lG_out_ga(0, [])
s2lG_in_ga(s(T89), .(X386, X387)) → U3_ga(T89, X386, X387, s2lG_in_ga(T89, X387))
U3_ga(T89, X386, X387, s2lG_out_ga(T89, X387)) → s2lG_out_ga(s(T89), .(X386, X387))
U7_g(T82, s2lG_out_ga(T82, X347)) → goalI_out_g(s(T82))
goalI_in_g(s(T82)) → U8_g(T82, s2lG_in_ga(T82, T83))
U8_g(T82, s2lG_out_ga(T82, T83)) → U9_g(T82, confE_in_g(.(X346, T83)))
confE_in_g(T65) → U2_g(T65, del2F_in_ga(T65, X280))
del2F_in_ga(T73, X313) → U4_ga(T73, X313, delA_in_aga(X310, T73, X311))
delA_in_aga(X151, [], []) → delA_out_aga(X151, [], [])
delA_in_aga(T29, .(T29, T30), T30) → delA_out_aga(T29, .(T29, T30), T30)
delA_in_aga(X190, .(T49, T51), .(T49, X192)) → U1_aga(X190, T49, T51, X192, delA_in_aga(X190, T51, X192))
U1_aga(X190, T49, T51, X192, delA_out_aga(X190, T51, X192)) → delA_out_aga(X190, .(T49, T51), .(T49, X192))
U4_ga(T73, X313, delA_out_aga(X310, T73, X311)) → del2F_out_ga(T73, X313)
del2F_in_ga(T73, X313) → U5_ga(T73, X313, delA_in_aga(T74, T73, T75))
U5_ga(T73, X313, delA_out_aga(T74, T73, T75)) → U6_ga(T73, X313, delA_in_aga(X312, T75, X313))
U6_ga(T73, X313, delA_out_aga(X312, T75, X313)) → del2F_out_ga(T73, X313)
U2_g(T65, del2F_out_ga(T65, X280)) → confE_out_g(T65)
U9_g(T82, confE_out_g(.(X346, T83))) → goalI_out_g(s(T82))

The argument filtering Pi contains the following mapping:
goalI_in_g(x1)  =  goalI_in_g(x1)
s(x1)  =  s(x1)
U7_g(x1, x2)  =  U7_g(x2)
s2lG_in_ga(x1, x2)  =  s2lG_in_ga(x1)
0  =  0
s2lG_out_ga(x1, x2)  =  s2lG_out_ga(x2)
U3_ga(x1, x2, x3, x4)  =  U3_ga(x4)
.(x1, x2)  =  .(x2)
goalI_out_g(x1)  =  goalI_out_g
U8_g(x1, x2)  =  U8_g(x2)
U9_g(x1, x2)  =  U9_g(x2)
confE_in_g(x1)  =  confE_in_g(x1)
U2_g(x1, x2)  =  U2_g(x2)
del2F_in_ga(x1, x2)  =  del2F_in_ga(x1)
U4_ga(x1, x2, x3)  =  U4_ga(x3)
delA_in_aga(x1, x2, x3)  =  delA_in_aga(x2)
[]  =  []
delA_out_aga(x1, x2, x3)  =  delA_out_aga(x3)
U1_aga(x1, x2, x3, x4, x5)  =  U1_aga(x5)
del2F_out_ga(x1, x2)  =  del2F_out_ga
U5_ga(x1, x2, x3)  =  U5_ga(x3)
U6_ga(x1, x2, x3)  =  U6_ga(x3)
confE_out_g(x1)  =  confE_out_g
DELA_IN_AGA(x1, x2, x3)  =  DELA_IN_AGA(x2)

We have to consider all (P,R,Pi)-chains

(10) UsableRulesProof (EQUIVALENT transformation)

For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R.

(11) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

DELA_IN_AGA(X190, .(T49, T51), .(T49, X192)) → DELA_IN_AGA(X190, T51, X192)

R is empty.
The argument filtering Pi contains the following mapping:
.(x1, x2)  =  .(x2)
DELA_IN_AGA(x1, x2, x3)  =  DELA_IN_AGA(x2)

We have to consider all (P,R,Pi)-chains

(12) PiDPToQDPProof (SOUND transformation)

Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi.

(13) Obligation:

Q DP problem:
The TRS P consists of the following rules:

DELA_IN_AGA(.(T51)) → DELA_IN_AGA(T51)

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.

(14) QDPSizeChangeProof (EQUIVALENT transformation)

By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

  • DELA_IN_AGA(.(T51)) → DELA_IN_AGA(T51)
    The graph contains the following edges 1 > 1

(15) YES

(16) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

S2LG_IN_GA(s(T89), .(X386, X387)) → S2LG_IN_GA(T89, X387)

The TRS R consists of the following rules:

goalI_in_g(s(T82)) → U7_g(T82, s2lG_in_ga(T82, X347))
s2lG_in_ga(0, []) → s2lG_out_ga(0, [])
s2lG_in_ga(s(T89), .(X386, X387)) → U3_ga(T89, X386, X387, s2lG_in_ga(T89, X387))
U3_ga(T89, X386, X387, s2lG_out_ga(T89, X387)) → s2lG_out_ga(s(T89), .(X386, X387))
U7_g(T82, s2lG_out_ga(T82, X347)) → goalI_out_g(s(T82))
goalI_in_g(s(T82)) → U8_g(T82, s2lG_in_ga(T82, T83))
U8_g(T82, s2lG_out_ga(T82, T83)) → U9_g(T82, confE_in_g(.(X346, T83)))
confE_in_g(T65) → U2_g(T65, del2F_in_ga(T65, X280))
del2F_in_ga(T73, X313) → U4_ga(T73, X313, delA_in_aga(X310, T73, X311))
delA_in_aga(X151, [], []) → delA_out_aga(X151, [], [])
delA_in_aga(T29, .(T29, T30), T30) → delA_out_aga(T29, .(T29, T30), T30)
delA_in_aga(X190, .(T49, T51), .(T49, X192)) → U1_aga(X190, T49, T51, X192, delA_in_aga(X190, T51, X192))
U1_aga(X190, T49, T51, X192, delA_out_aga(X190, T51, X192)) → delA_out_aga(X190, .(T49, T51), .(T49, X192))
U4_ga(T73, X313, delA_out_aga(X310, T73, X311)) → del2F_out_ga(T73, X313)
del2F_in_ga(T73, X313) → U5_ga(T73, X313, delA_in_aga(T74, T73, T75))
U5_ga(T73, X313, delA_out_aga(T74, T73, T75)) → U6_ga(T73, X313, delA_in_aga(X312, T75, X313))
U6_ga(T73, X313, delA_out_aga(X312, T75, X313)) → del2F_out_ga(T73, X313)
U2_g(T65, del2F_out_ga(T65, X280)) → confE_out_g(T65)
U9_g(T82, confE_out_g(.(X346, T83))) → goalI_out_g(s(T82))

The argument filtering Pi contains the following mapping:
goalI_in_g(x1)  =  goalI_in_g(x1)
s(x1)  =  s(x1)
U7_g(x1, x2)  =  U7_g(x2)
s2lG_in_ga(x1, x2)  =  s2lG_in_ga(x1)
0  =  0
s2lG_out_ga(x1, x2)  =  s2lG_out_ga(x2)
U3_ga(x1, x2, x3, x4)  =  U3_ga(x4)
.(x1, x2)  =  .(x2)
goalI_out_g(x1)  =  goalI_out_g
U8_g(x1, x2)  =  U8_g(x2)
U9_g(x1, x2)  =  U9_g(x2)
confE_in_g(x1)  =  confE_in_g(x1)
U2_g(x1, x2)  =  U2_g(x2)
del2F_in_ga(x1, x2)  =  del2F_in_ga(x1)
U4_ga(x1, x2, x3)  =  U4_ga(x3)
delA_in_aga(x1, x2, x3)  =  delA_in_aga(x2)
[]  =  []
delA_out_aga(x1, x2, x3)  =  delA_out_aga(x3)
U1_aga(x1, x2, x3, x4, x5)  =  U1_aga(x5)
del2F_out_ga(x1, x2)  =  del2F_out_ga
U5_ga(x1, x2, x3)  =  U5_ga(x3)
U6_ga(x1, x2, x3)  =  U6_ga(x3)
confE_out_g(x1)  =  confE_out_g
S2LG_IN_GA(x1, x2)  =  S2LG_IN_GA(x1)

We have to consider all (P,R,Pi)-chains

(17) UsableRulesProof (EQUIVALENT transformation)

For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R.

(18) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

S2LG_IN_GA(s(T89), .(X386, X387)) → S2LG_IN_GA(T89, X387)

R is empty.
The argument filtering Pi contains the following mapping:
s(x1)  =  s(x1)
.(x1, x2)  =  .(x2)
S2LG_IN_GA(x1, x2)  =  S2LG_IN_GA(x1)

We have to consider all (P,R,Pi)-chains

(19) PiDPToQDPProof (SOUND transformation)

Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi.

(20) Obligation:

Q DP problem:
The TRS P consists of the following rules:

S2LG_IN_GA(s(T89)) → S2LG_IN_GA(T89)

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.

(21) QDPSizeChangeProof (EQUIVALENT transformation)

By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

  • S2LG_IN_GA(s(T89)) → S2LG_IN_GA(T89)
    The graph contains the following edges 1 > 1

(22) YES